Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar1/SK90SLASH2.51.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

ack₂(0, y) -> s₁(y)
ack₂(s₁(x), 0) -> ack₂(x, s₁(0))
ack₂(s₁(x), s₁(y)) -> ack₂(x, ack₂(s₁(x), y))

Q is empty.

↳ QTRS

  ↳ Non-Overlap Check

Q restricted rewrite system:
The TRS R consists of the following rules:

ack₂(0, y) -> s₁(y)
ack₂(s₁(x), 0) -> ack₂(x, s₁(0))
ack₂(s₁(x), s₁(y)) -> ack₂(x, ack₂(s₁(x), y))

Q is empty.

The TRS is non-overlapping. Hence, we can switch to innermost.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

ack₂(0, y) -> s₁(y)
ack₂(s₁(x), 0) -> ack₂(x, s₁(0))
ack₂(s₁(x), s₁(y)) -> ack₂(x, ack₂(s₁(x), y))

The set Q consists of the following terms:

ack₂(0, x0)
ack₂(s₁(x0), 0)
ack₂(s₁(x0), s₁(x1))

Q DP problem:
The TRS P consists of the following rules:

ACK₂(s₁(x), s₁(y)) -> ACK₂(s₁(x), y)
ACK₂(s₁(x), s₁(y)) -> ACK₂(x, ack₂(s₁(x), y))
ACK₂(s₁(x), 0) -> ACK₂(x, s₁(0))

The TRS R consists of the following rules:

ack₂(0, y) -> s₁(y)
ack₂(s₁(x), 0) -> ack₂(x, s₁(0))
ack₂(s₁(x), s₁(y)) -> ack₂(x, ack₂(s₁(x), y))

The set Q consists of the following terms:

ack₂(0, x0)
ack₂(s₁(x0), 0)
ack₂(s₁(x0), s₁(x1))

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ QDPAfsSolverProof

Q DP problem:
The TRS P consists of the following rules:

ACK₂(s₁(x), s₁(y)) -> ACK₂(s₁(x), y)
ACK₂(s₁(x), s₁(y)) -> ACK₂(x, ack₂(s₁(x), y))
ACK₂(s₁(x), 0) -> ACK₂(x, s₁(0))

The TRS R consists of the following rules:

ack₂(0, y) -> s₁(y)
ack₂(s₁(x), 0) -> ack₂(x, s₁(0))
ack₂(s₁(x), s₁(y)) -> ack₂(x, ack₂(s₁(x), y))

The set Q consists of the following terms:

ack₂(0, x0)
ack₂(s₁(x0), 0)
ack₂(s₁(x0), s₁(x1))

We have to consider all minimal (P,Q,R)-chains.
By using an argument filtering and a montonic ordering, at least one Dependency Pair of this SCC can be strictly oriented.

ACK₂(s₁(x), s₁(y)) -> ACK₂(x, ack₂(s₁(x), y))
ACK₂(s₁(x), 0) -> ACK₂(x, s₁(0))

Used argument filtering: ACK₂(x1, x2) = x1
s₁(x1) = s₁(x1)
ack₂(x1, x2) = ack₂(x1, x2)
0 = 0
Used ordering: Precedence:

ack₂ > s₁

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ QDPAfsSolverProof

            ↳ QDP

              ↳ QDPAfsSolverProof

Q DP problem:
The TRS P consists of the following rules:

ACK₂(s₁(x), s₁(y)) -> ACK₂(s₁(x), y)

The TRS R consists of the following rules:

ack₂(0, y) -> s₁(y)
ack₂(s₁(x), 0) -> ack₂(x, s₁(0))
ack₂(s₁(x), s₁(y)) -> ack₂(x, ack₂(s₁(x), y))

The set Q consists of the following terms:

ack₂(0, x0)
ack₂(s₁(x0), 0)
ack₂(s₁(x0), s₁(x1))

We have to consider all minimal (P,Q,R)-chains.
By using an argument filtering and a montonic ordering, at least one Dependency Pair of this SCC can be strictly oriented.

ACK₂(s₁(x), s₁(y)) -> ACK₂(s₁(x), y)

Used argument filtering: ACK₂(x1, x2) = x2
s₁(x1) = s₁(x1)
Used ordering: Precedence:

trivial

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ QDPAfsSolverProof

            ↳ QDP

              ↳ QDPAfsSolverProof

                ↳ QDP

                  ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

ack₂(0, y) -> s₁(y)
ack₂(s₁(x), 0) -> ack₂(x, s₁(0))
ack₂(s₁(x), s₁(y)) -> ack₂(x, ack₂(s₁(x), y))

The set Q consists of the following terms:

ack₂(0, x0)
ack₂(s₁(x0), 0)
ack₂(s₁(x0), s₁(x1))

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.